Note on fast division algorithm for polynomials using Newton iteration
نویسندگان
چکیده
The classical division algorithm for polynomials requires O(n) operations for inputs of size n. Using reversal technique and Newton iteration, it can be improved to O(M(n)), where M is a multiplication time. But the method requires that the degree of the modulo, x, should be the power of 2. If l is not a power of 2 and f(0) = 1, Gathen and Gerhard suggest to compute the inverse, f, modulo x r⌉, x r−1⌉, · · · , x, x, separately. But they did not specify the iterative step. In this note, we show that the original Newton iteration formula can be directly used to compute fmodx without any additional cost, when l is not a power of 2.
منابع مشابه
A Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کاملA Note on Scalar Multiplication Using Division Polynomials
Scalar multiplication is the most important and expensive operation in elliptic curve cryptosystems. In this paper we improve the efficiency of the Elliptic Net algorithm to compute scalar multiplication by using the equivalence of elliptic nets. The proposed method saves four multiplications in each iteration loop. Experimental results also indicates that our algorithm will be more efficient t...
متن کاملPartial Fraction Decomposition , Sylvester Matrices , Convolution and Newton ’ s Iteration ∗
Both Sylvester matrix and convolution are defined by two polynomials. If one of them has small degree, then the associated Sylvester linear system can be solved fast by using its PFD interpretation of the convolution equation. This can immediately simplify the refinement of approximate convolution by means of Newton’s iteration, where we also incorporate the PFD refinement techniques or alterna...
متن کاملTR-2011003: Partial Fraction Decomposition, Sylvester Matrices, Convolution and Newton's Iteration
Both Sylvester matrix and convolution are defined by two polynomials. If one of them has small degree, then the associated Sylvester linear system can be solved fast by using its PFD interpretation of the convolution equation. This can immediately simplify the refinement of approximate convolution by means of Newton’s iteration, where we also incorporate the PFD refinement techniques or alterna...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1112.4014 شماره
صفحات -
تاریخ انتشار 2011